An Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs
نویسندگان
چکیده
منابع مشابه
An Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs
Orthogonal arrays are used widely in manufacturing and high-technology industries for quality and productivity improvement experiments. For reasons of run size economy or flexibility, nearly orthogonal arrays are also used. The construction of orthogonal or nearly orthogonal arrays can be quite challenging. Most existing methods are complex and produce limited types of arrays. This article desc...
متن کاملAn algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays
Due to run size constraints, near-orthogonal arrays (near-OAs) and supersaturated designs, a special case of near-OA, are considered good alternatives to OAs. This paper shows (i) a combinatorial relationship between a mixed-level array and a nonresolvable incomplete block design (IBD) with varying replications (and its dual, a resolvable IBD with varying block sizes); (ii) the relationship bet...
متن کاملOn a Grouping Method for Constructing Mixed Orthogonal Arrays
Mixed orthogonal arrays of strength two and size s are constructed by grouping points in the finite projective geometry . can be partitioned into 1, PG mn s 1, PG mn s 1 1 mn n s s –1 n -flats such that each –1 n flat is associated with a point in . An orthogonal array 1, n PG m s 1 1 mn n mn s s n s L s can be constructed ...
متن کاملA linear programming bound for orthogonal arrays with mixed levels
We show how the Delsarte theory can be used to obtain a linear programming bound for orthogonal arrays with mixed levels. Even for strength 2 this improves on the Rao bound in a large number of cases. The results point to several interesting sets of parameters for which the existence of the arrays is at present undecided. A M S classification: 05 B15; 62 K15
متن کاملParameter Inequalities for Orthogonal Arrays with Mixed Levels
An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a generalization of an inequality developed by Bierbrauer for symmetric orthogonal arrays. We will utilize his algebraic approach to provide an analogous inequality for orthogonal arrays having mixed levels and show that the b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Technometrics
سال: 2002
ISSN: 0040-1706,1537-2723
DOI: 10.1198/004017002188618554